A linear time algorithm for edge coloring of binomial trees
نویسندگان
چکیده
منابع مشابه
A linear time algorithm for edge coloring of binomial trees
We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(n) time algorithm for optimal coloring of such a tree, where n is the number of vertices of T. Al...
متن کاملA Linear Algorithm for Edge-Coloring Partial k-Trees
A b s t r a c t . Many combinatorial problems can be efficiently solved for partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no linear-time algorithm has been obtained for partial k-trees. The best known algorithm solves the problem for partial k-trees G in time O(nA 2~r where n is the number of vertices and A is the maximum degree of G. This paper giv...
متن کاملA Parallel Algorithm for Edge-Coloring Partial k-Trees
Many combinatorial problems can be efficiently solved for partial ktrees (graphs of treewidth bounded by k). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial k-trees. This paper gives an optimal and first NC parallel algorithm which finds an edge-coloring of a given partial k-tree using a minimum number of colors.
متن کاملAlgorithm for the Cost Edge-Coloring of Trees
Let C be a set of colors, and let ω be a cost function which assigns a real number ω(c) to each color c in C. An edge-coloring of a graph G is to color all the edges of G so that any two adjacent edges are colored with different colors. In this paper we give an efficient algorithm to find an optimal edge-coloring of a given tree T , that is, an edgecoloring f of T such that the sum of costs ω(f...
متن کاملA Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs
Let G be a series-parallel graph. In this paper, we present a linear algorithm of constructing an oriented binary decomposition tree of G. We use it to find 33 unavoidable subgraphs of G. Based on these 33 avoidable subgraphs, we can determine the edge-face chromatic number, denoted by χef (G), of G where G is 2-connected and Δ(G) = 5. This completes the literature of determining χef (G) for 2-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00191-x